Finding Fullerene Patches in Polynomial Time I: Counting Hexagonal Patches
نویسندگان
چکیده
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting problem: given a sequence of twos and threes, how many hexagonal patches exist with this degree sequence along the outer face? This problem is motivated by the study of benzenoid hydrocarbons and fullerenes in computational chemistry. We give the first polynomial time algorithm for this problem.
منابع مشابه
Finding Fullerene Patches in Polynomial Time
We consider the following question, motivated by the enumeration of fullerenes. A fullerene patch is a 2-connected plane graph G in which inner faces have length 5 or 6, non-boundary vertices have degree 3, and boundary vertices have degree 2 or 3. The degree sequence along the boundary is called the boundary code of G. We show that the question whether a given sequence S is a boundary code of ...
متن کاملFullerene patches I
Large carbon molecules, discovered at the end of the last century, are called fullerenes. The most famous of these, C60 has the structure of the soccer ball: the seams represent chemical bonds and the points where three seams come together represent the carbon atoms. We use the term fullerene to represent all mathematically possible structures for the chemical fullerenes: trivalent plane graphs...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملThe effect of acid modification of porcine mucin on its drug release and skin permeation properties in insulin transdermal patches
The study aimed at determining the effect of acid modified porcine mucin powder on the release and permeation of insulin in transdermal patches. Various batches of insulin patches were prepared by solvent casting method using polysorbate 80 as emulsifying agent and acid treated and untreated mucin powders as base. The patches were evaluated for their physical properties, folding endurance, moi...
متن کاملStudy of fullerenes by their algebraic properties
The eigenvalues of a graph is the root of its characteristic polynomial. A fullerene F is a 3- connected graphs with entirely 12 pentagonal faces and n/2 -10 hexagonal faces, where n is the number of vertices of F. In this paper we investigate the eigenvalues of a class of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0808.3881 شماره
صفحات -
تاریخ انتشار 2008